Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients
نویسندگان
چکیده
In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(β) for a sufficiently large number β. In the multivariate case, we introduce the modified Kronecker substitution to reduce the interpolation of a multivariate polynomial to the univariate case. Both algorithms have polynomial bit-size complexity.
منابع مشابه
Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients
In this paper, we give new sparse interpolation algorithms for black box univariate and multivariate rational functions h = f/g whose coefficients are integers with an upper bound. The main idea is as follows: choose a proper integer β and let h(β) = a/b with gcd(a, b) = 1. Then f and g can be computed by solving the polynomial interpolation problems f(β) = ka and g(β) = ka for some integer k. ...
متن کاملSparse pseudospectral approximation method
Multivariate global polynomial approximations – such as polynomial chaos or stochastic collocation methods – are now in widespread use for sensitivity analysis and uncertainty quantification. The pseudospectral variety of these methods uses a numerical integration rule to approximate the Fourier-type coefficients of a truncated expansion in orthogonal polynomials. For problems in more than two ...
متن کاملGlobal Residues for Sparse Polynomial Systems
We consider families of sparse Laurent polynomials f1, . . . , fn with a finite set of common zeroes Zf in the torus T n = (C − {0}) . The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over Zf . We present a new symbolic algorithm for computing the global residue as a rational function of the coefficients of the fi when the Newton polytopes of the fi ...
متن کاملGlobal sensitivity analysis using sparse grid interpolation and polynomial chaos
Sparse grid interpolation is widely used to provide good approximations to smooth functions in high dimensions based on relatively few function evaluations. By using an efficient conversion from the interpolating polynomial provided by evaluations on a sparse grid to a representation in terms of orthogonal polynomials (gPC representation), we show how to use these relatively few function evalua...
متن کاملAn Interpolation Algorithm for Sparse Polynomials overZm
We give a quasi-polynomial time algorithm for the problem of interpolating sparse polynomials over integer residue class ringsZm from their values given by a black box. This is a further development of [10].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017